On the Minimum of a Positive Definite Quadratic Form over Non-Zero Lattice points. Theory and Applications

Let Σ`` d be the set of positive definite matrices with determinant 1 in dimension d ě 2. Identifying any two SLdpZq–congruent elements in Σ `` d gives rise to the space of reduced quadratic forms of determinant one, which in turn can be identified with the locally symmetric space Xd :“ SLdpZqzSLdpRq{SOdpRq. Equip the latter space with its natural probability measure coming from a Haar measure on SLdpRq. In 1998, Kleinbock and Margulis [11] established sharp estimates for the probability that an element of Xd takes a value less than a given real number δ ą 0 over the non–zero lattice points Zzt0u. In this article, these estimates are extended to a large class of probability measures arising either from the spectral or the Cholesky decomposition of an element of Σ`` d . The sharpness of the bounds thus obtained are also established (up to multiplicative constants) for a subclass of these measures. Although of an independent interest, this theory is partly developed here with a view towards application to Information Theory. More precisely, after providing a concise introduction to this topic fitted to our needs, we lay the theoretical foundations of the study of some manifolds frequently appearing in the theory of Signal Processing. This is then applied to the recently introduced Integer–Forcing Receiver Architecture channel whose importance stems from its expected high performance. Here, we give sharp estimates for the probabilistic distribution of the so–called Effective Signal–to–Noise Ratio, which is an essential quantity in the evaluation of the performance of this model. In honorem Henriettae Dickinsonis.